Performance of a connectionless protocol over ATM

Recent studies show the existence of a demand for a connectionless broadband service. In order to cope with this demand, a connectionless protocol for the B-ISDN needs to be designed. Such a protocol should make use of ATM and the ATM Adaptation Layer. It needs to specify destination and bandwidth of connections to the ATM network without advance knowledge of the traffic that has to be transferred over these connection. A possible mechanism which can cope with this problem, the 'On-demand Connection with Delayed Release' (OCDR) mechanism, is described. Its eficient operation is based on the assumption that there exists a certain correlation between subsequently arriving CL packets. Two different arrival processes are used to evaluate the performance of the OCDR mechanism: a Poisson arrival process, and a Markov Modulated Poisson Process (MMPP) which models a bursty trafic source. Markov models of the OCDR mechanism have been constructed for both arrival processes. For the madel with Poisson arrivals, a closed form solution is presented. The model with MMPP arrivals is solved numerically.\ud Compared to a 'Permanent Connection' mechanism significant bandwidth reductions can be obtained provided that the offered trafic has a bursty nature. Furthermore, the OCDR mechanism has the advantageous property that the obtained average node delay is not strongly related to the intensity and burstiness of the offered trafic

A centralized feedback control model for resource management in wireless networks

In a wireless environment, guaranteeing QoS is challenging because applications at multiple devices share the same limited radio bandwidth. In this paper we introduce and study a resource management model for centralized wireless networks, using feedback control theory. Before applying in practice, the proposed model is evaluated using the well-known 20-sim dynamic system simulator. The experimental results show that flexible and efficient resource allocation can be achieved for a variety of system parameters and WLAN scenarios; however, care should be taken in setting the control parameters and coefficients

Modelling segmentation and reassembly processes in communication networks

Segmentation and reassembly are techniques that are needed to transport the messages, generated by users, over communication networks that in general use smaller sized data units. Queueing networks are widely used for the performance modelling and analysis of such communication networks. To model and analyze the segmentation and reassembly processes, we relax the constraints, and extend the analysis of the class of queueing networks considered in QNA, a software package developed at AT&T Bell Labs by Whitt et. al. ([1]). We introduce two new types of nodes in queueing networks: namely segmentation nodes and reassembly nodes. We present the analysis of these nodes in the context of QNA